Global Optimization of Placement of Multiple Injection Wells with Simulated Annealing
نویسندگان
چکیده
منابع مشابه
Simulated Annealing and Global Optimization
Nelder-Mead (when you don’t know ∇f ) and steepest descent/conjugate gradient (when you do). Both of these methods are based on attempting to generate a sequence of positions xk with monotonically decreasing f(xk) in the hopes that the xk → x∗, the global minimum for f . If f is a convex function (this happens surprisingly often), and has only one local minimum, these methods are exactly the ri...
متن کاملGlobal optimization and simulated annealing
In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of N" in which some real valued function f assumes its optimal (maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing algorithm. The approach closely follows the formulation of the simulated annealing algorithm as orig...
متن کاملGlobal optimization and simulated annealing
In this paper we are concerned with global optimization, which can be defined as the problem of finding points on a bounded subset of IRn in which some real valued functionf assumes its optimal (i.e. maximal or minimal) value. We present a stochastic approach which is based on the simulated annealing algorithm. The approach closely follows the formulation of the simulated annealing algorithm as...
متن کاملSimulated Annealing With Parameter Tuning for Wind Turbine Placement Optimization
Because of wake effects and geographical constraints, the search for optimal positions of wind turbines has an important part to play for their efficiency. The determination of their positions can be treated as optimization problem and can be solved by various methods. In this paper, we propose optimization approaches based on Simulated Annealing (SA) to improve solutions for the wind turbines ...
متن کاملThe R Package optimization: Flexible Global Optimization with Simulated-Annealing
Standard numerical optimization approaches require several restrictions. So do exact optimization methods such as the Linear Programming approach appeal for linearity and Nelder-Mead for unimodality of the loss function. One method to relax these assumptions is the Simulated Annealing approach, which reduces the risk of getting trapped in a local optimum. However, the standard implementation st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Engineering Geology
سال: 2015
ISSN: 1226-5268
DOI: 10.9720/kseg.2015.1.67